Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
21	Problem Solving, Programming, and Calculation Björn Lisper School of Innovation, Design, and Engineering Mälardalen University http://www.idt.mdh.se/˜blr/ Add to Reading List Source URL: www.idt.mdh.se Language: English - Date: 2015-04-12 17:46:16 Software engineering Computer programming Computing Recursion Lambda calculus Computability theory Theoretical computer science Programming idioms Functional programming Function Subroutine Fixed-point combinator
22	Types and Type-Free λ-Calculus Dana S. Scott, FBA, FNAS University Professor Emeritus Carnegie Mellon University Visiting Scholar Add to Reading List Source URL: www1.maths.leeds.ac.uk Language: English - Date: 2016-06-16 11:50:12 Computability theory Theoretical computer science Mathematical logic Theory of computation Models of computation Formal methods Logic in computer science Lambda calculus Recursively enumerable set -recursive function Denotational semantics Numbering
23	Session F2C NON-DETERMINISM IN CS HIGH-SCHOOL CURRICULA Michal Armoni 1 and Judith Gal-Ezer 2 Abstract - One of the units in the relatively new high school CS curriculum which is being implemented in Israel is a Add to Reading List Source URL: www.openu.ac.il Language: English - Date: 2009-03-16 13:56:00 Finite automata Automata theory Nondeterministic finite automaton Deterministic automaton Theoretical computer science Finite-state machine Deterministic finite automaton Computability Regular language NP Muller automaton Bchi automaton
24	MCS 441 – Theory of Computation I Spring 2016 Problem Set 4 Lev Reyzin Due: at the beginning of class Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-03-11 11:17:16 Theoretical computer science Turing machine Theory of computation Computability theory Computer science Alan Turing Models of computation Machine that always halts Computability NP
25	In: Partial Evaluation, International Seminar, Dagstuhl Castle, Germany, February 1996, Lecture Notes in Computer Science 1110, Springer, 1996 ppInvited paper) A Comparative Revisitation of Some Program Tran Add to Reading List Source URL: repository.readscheme.org Language: English - Date: 2010-10-22 08:04:37 Software engineering Computer programming Software development Programming idioms Computability theory Functional programming Theoretical computer science Logic programming Unfolding Recursion Free variables and bound variables Symbolic computation
26	The CPS transform from Griffin. Let us first repeat what Herman already showed on the blackboard. The definition of the CPS transform in Griffin is: x = λk. kx λx. M = λk. k (λx. M ) M N = λk. M (λm. N (λn. mnk)) Add to Reading List Source URL: www.cs.ru.nl Language: English - Date: 2011-11-28 07:13:57 Computability theory Mathematical logic Theoretical computer science Mathematics Differential topology Orbifold Combinatory logic
27	EPJ Web of Conferences 113, DOI: epjconf021 C Owned by the authors, published by EDP Sciences, 2016 Higgs particles interacting via a scalar Dark Matter ﬁeld Add to Reading List Source URL: www.epj-conferences.org Language: English Computability theory operator Operator theory Probability distributions
28	On Induction Principles C. Verhoef Programming Research Group University of Amsterdam KruislaanSJ Amsterdam Add to Reading List Source URL: www.cs.vu.nl Language: English - Date: 2005-08-09 06:28:59 Mathematics Theoretical computer science Mathematical analysis Operator theory Computability theory Automated theorem proving Logic programming Type theory Unification operator Spectral theory of ordinary differential equations
29	All-Termination(T )? Panagiotis Manolios and Aaron Turon Northeastern University {pete,turon}@ccs.neu.edu Abstract. We introduce the All-Termination(T ) problem: given a termination solver T and a collection of functions Add to Reading List Source URL: www.mpi-sws.org Language: English - Date: 2010-01-10 16:47:25 Mathematical analysis Mathematics Analysis Functions and mappings Static program analysis Termination analysis Limit of a function IP Well-founded relation Measure theory Computability theory Inequalities
30	The key to blame: Gradual typing meets cryptography Jeremy Siek Philip Wadler Indiana University, USA Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2016-07-07 08:33:11 Theoretical computer science Mathematics Mathematical logic Logic in computer science Models of computation Lambda calculus Computability theory Valuation Denotational semantics Combinatory logic Holomorphic functional calculus

UPDATE